Characterization of Unlabeled Level Planar Graphs
نویسندگان
چکیده
We present the set of planar graphs that always have a simultaneous geometric embedding with a strictly monotonic path on the same set of n vertices, for any of the n! possible mappings. These graphs are equivalent to the set of unlabeled level planar (ULP) graphs that are level planar over all possible labelings. Our contributions are twofold. First, we provide linear time drawing algorithms for ULP graphs. Second, we provide a complete characterization of ULP graphs by showing that any other graph must contain a subgraph homeomorphic to one of seven forbidden graphs.
منابع مشابه
Matched Drawings of Planar Graphs
A natural way to draw two planar graphs whose vertex sets are matched is to assign each matched pair a unique y-coordinate. In this paper we introduce the concept of such matched drawings, which are a relaxation of simultaneous geometric embeddings with mapping. We study which classes of graphs allow matched drawings and show that (i) two 3-connected planar graphs or a 3-connected planar graph ...
متن کاملGenerating unlabeled connected cubic planar graphs uniformly at random
We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, i.e., we count connected cubic planar graphs up to isomorphisms that fix a certain directed edge. Based on decompositions along the connectivity structure, we derive recurrence formulas for the exact number of rooted ...
متن کاملPlanar Graphs, via Well-Orderly Maps and Trees
The family of well-orderly maps is a family of planar maps with the property that every connected planar graph has at least one plane embedding which is a well-orderly map.We show that the number of well-orderly maps with n nodes is at most 2αn+O(log , where α ≈ 4.91. A direct consequence of this is a new upper bound on the numberp(n) of unlabeled planar graphs with n nodes, log2 p(n) 4.91n. Th...
متن کاملSampling Unlabeled Biconnected Planar Graphs
We present an expected polynomial time algorithm to generate a 2-connected unlabeled planar graph uniformly at random. To do this we first derive recurrence formulas to count the exact number of rooted 2-connected planar graphs, based on a decomposition along the connectivity structure. For 3-connected planar graphs we use the fact that they have a unique embedding on the sphere. Special care h...
متن کامل$n$-Array Jacobson graphs
We generalize the notion of Jacobson graphs into $n$-array columns called $n$-array Jacobson graphs and determine their connectivities and diameters. Also, we will study forbidden structures of these graphs and determine when an $n$-array Jacobson graph is planar, outer planar, projective, perfect or domination perfect.
متن کامل